On graph closures
نویسندگان
چکیده
منابع مشابه
Graph Decomposition and Recursive Closures
Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes of the graph, e is the numbers of the edges, and b is the graph’s breadth. It is a better computation...
متن کاملGraph Closures and Metric Compactifications of Tv
It is shown that all compactifications of the positive integers N which have metrizable remainders are themselves metrizable. This is done by first proving that each Hausdorff compactification of a noncompact locally compact space is the graph closure in an appropriate space. It is then shown that any two compactifications of N which have homeomorphic metrizable remainders are homeomorphic.
متن کاملDistance closures on complex networks
To expand the toolbox available to network science, we study the isomorphism between distance and Fuzzy (proximity or strength) graphs. Distinct transitive closures in Fuzzy graphs lead to closures of their isomorphic distance graphs with widely different structural properties. For instance, the All Pairs Shortest Paths (APSP) problem, based on the Dijkstra algorithm, is equivalent to a metric ...
متن کاملDistinguishability Operations and Closures on Regular Languages
In this paper we study the language of the words that, for a given language L, distinguish between pairs of different left-quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. We give an upper bound for the state complexity of the dist...
متن کاملEssays on Coxeter groups Bruhat closures
If G is a split reductive group and B a Borel subgroup then G is the disjoint union of the BwB as w ranges over the Weyl group of a maximal torus in B. The closure of BwB is the union of certain double cosets BxB, where the x that occur can be characterized in purely combinatorial terms. Somewhat surprisingly, this combinatorial definition may be extended to define the Bruhat closure operation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00573-3